#include"RBTree.h"
void TestRBTree1()
{
	RBTree<int> t;
	//int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
	for (auto e : a)
	{
		/*if (e == 9)
		{
			int i = 0;
		}*/

		t.insert(e);

		//cout << e << "->" << t.IsBalanceTree() << endl;
		//t.InOrder();
	}

	t.InOrder();
	cout << t.IsBRTree() << endl;
}
int main()
{
	TestRBTree1();
	return 0;
}